Codes Correcting Two Deletions
نویسندگان
چکیده
In this work, we investigate the problem of constructing codes capable of correcting two deletions. In particular, we construct a code that requires redundancy approximately 8 log2 n+O(log2 log2 n) bits of redundancy, where n denotes the length of the code. To the best of the author’s knowledge, this represents the best known construction in that it requires the lowest number of redundant bits for a code correcting two deletions.
منابع مشابه
Codes for Correcting a Burst of Deletions or Insertions
This paper studies codes which correct bursts of deletions. Namely, a binary code will be called a b-burst-correcting code if it can correct a deletion of any b consecutive bits. While the lower bound on the redundancy of such codes was shown by Levenshtein to be asymptotically log(n) + b− 1, the redundancy of the best code construction by Cheng et al. is b(log(n/b+1)). In this paper, we close ...
متن کاملCoding against deletions in oblivious and online models
We consider binary error correcting codes when errors are deletions. A basic challenge concerning deletion codes is determining p (adv) 0 , the zero-rate threshold of adversarial deletions, defined to be the supremumof allp for which there exists a code familywith rate bounded away from0 capable of correcting a fraction p of adversarial deletions. A recent construction of deletion-correcting co...
متن کاملOn multiple insertion/Deletion correcting codes
We investigate binary, number-theoretic, bit insertion/deletion correcting codes as pioneered by Levenshtein. The weight spectra and Hamming distance properties of single insertion/deletion error-correcting codes are analyzed. These relationships are then extended to investigate codes that can correct multiple random insertions and deletions. From these relationships, new bounds are derived and...
متن کاملBounds on Codes Correcting Tandem and Palindromic Duplications
In this work, we derive upper bounds on the cardinality of tandem and palindromic duplication correcting codes by deriving the generalized sphere packing bound for these error types. We first prove that an upper bound for tandem or palindromic deletions is also an upper bound for inserting the respective type of duplications. Therefore, we derive the bounds based on these special deletions as t...
متن کاملCorrecting Bursty and Localized Deletions Using Guess & Check Codes
We consider the problem of constructing binary codes for correcting deletions that are localized within certain parts of the codeword that are unknown a priori. The model that we study is when δ ≤ w deletions occur in a window of size at most w bits. These δ deletions are not necessarily consecutive, but are restricted to the window of size w. The localized deletions model is a generalization o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.07222 شماره
صفحات -
تاریخ انتشار 2017